Moment methods in energy minimization David de Laat CWI Amsterdam Andrejewski-Tage Moment problems in theoretical physics

Source URL: www.daviddelaat.nl

• Operations research
• Discrete geometry
• NP-complete problems
• Conjectures
• Circle packing
• Sphere packing
• Independent set
• Kepler conjecture
• Tammes problem
• Mathematical optimization
• Semidefinite programming
• FranklRdl graph

Grothendieck Inequalities, Nonlocal Games and Optimization Jop Briët Grothendieck Inequalities,

Source URL: homepages.cwi.nl

• University of Amsterdam
• Mathematical optimization
• Inequalities
• Quantum mechanics
• Institute for Logic
• Language and Computation
• Semidefinite programming
• Grothendieck inequality
• Quantum entanglement

A semidefinite programming hierarchy for packing problems in discrete geometry David de Laat (TU Delft) Joint work with Frank Vallentin (Universit¨at zu K¨oln) Applications of Real Algebraic Geometry

Source URL: www.daviddelaat.nl

• NP-complete problems
• Operations research
• Independent set
• Optimization problem
• Discrete geometry
• Graph
• Duality
• Packing problems
• Mathematical optimization
• Planar graphs
• Matching
• Matroid

1 Tensor Completion for Estimating Missing Values in Visual Data Ji Liu, Przemyslaw Musialski, Peter Wonka, and Jieping Ye Abstract—In this paper we propose an algorithm to estimate missing values in tensors of visual

Source URL: peterwonka.net

• Linear algebra
• Matrix theory
• Tensors
• Mathematical optimization
• Numerical linear algebra
• Matrix completion
• Tensor rank decomposition
• Low-rank approximation
• Singular value decomposition
• Matrix
• Tensor
• Semidefinite programming

Mach Learn:3–39 DOIs10994A majorization-minimization approach to the sparse generalized eigenvalue problem Bharath K. Sriperumbudur · David A. Torres ·

Source URL: eceweb.ucsd.edu

• Multivariate statistics
• Operations research
• Mathematical optimization
• Numerical linear algebra
• Dimension reduction
• Sparse PCA
• Sparse approximation
• Principal component analysis
• Limit of a function
• Convex optimization
• Semidefinite programming
• K-SVD

Quantum Speed-ups for Semidefinite Programming Fernando G.S.L. Brandão MSR -> Caltech based on joint work with

Source URL: fernandobrandao.org

• Operations research
• Mathematical optimization
• Theoretical computer science
• Linear programming
• Real algebraic geometry
• Semidefinite programming
• Algorithm
• Quadratically constrained quadratic program

MITSUBISHI ELECTRIC RESEARCH LABORATORIES http://www.merl.com Degeneracy in Maximal Clique Decomposition for Semidefinite Programs Raghunathan, A.U.; Knyazev, A.

Source URL: www.merl.com

• Operations research
• Mathematical optimization
• Matrix theory
• Linear programming
• Real algebraic geometry
• Semidefinite programming
• Nonnegative matrix
• Matrix

SUMS OF SQUARES, MOMENT MATRICES AND OPTIMIZATION OVER POLYNOMIALS MONIQUE LAURENT∗ Updated version: February 6, 2010 Abstract. We consider the problem of minimizing a polynomial over a semialgebraic set defined by pol

Source URL: homepages.cwi.nl

• Mathematics
• Algebra
• Real algebraic geometry
• Mathematical optimization
• Operations research
• Matrices
• Linear programming
• Semidefinite programming
• Polynomial
• Moment problem
• Moment matrix
• Matrix

Block-diagonal semidefinite programming hierarchies for 0/1 programming

Source URL: homepages.cwi.nl

arXiv:1106.0321v2 [math.ST] 10 NovSparse Non Gaussian Component Analysis by Semidefinite Programming Elmar Diederichs ∗ Weierstrass Institute

Source URL: arxiv.org